Reasoning about firewall policies through refinement and composition
نویسندگان
چکیده
منابع مشابه
Reasoning about Dynamic Policies
People often need to reason about policy changes before they are adopted. For example, suppose a website manager knows that users want to enter her site without going through the welcome page. To decide whether or not to permit this, the wise manager will consider the consequences of modifying the policies (e.g., would this allow users to bypass advertisements and legal notices?). Similiarly, p...
متن کاملReasoning Automatically about Termination and Refinement
We present very short mechanised proofs of Bachmair and Dershowitz’s termination theorem in different variants of Kleene algebras. Through our experiments we also discover three novel refinement laws for nested infinite loops. Finally, we introduce novel divergence modules in which full automation could be achieved. These structures seem very promising for automated reasoning about infinite beh...
متن کاملReasoning Algebraically About Refinement on TSO Architectures
The Total Store Order memory model is widely implemented by modern multicore architectures such as x86, where local buffers are used for optimisation, allowing limited forms of instruction reordering. The presence of buffers and hardware-controlled buffer flushes increases the level of non-determinism from the level specified by a program, complicating the already difficult task of concurrent p...
متن کاملReasoning about Pointers in Refinement Calculus
Pointers are an important programming concept. They are used explicitely or implicitly in many programming languages. In particular, the semantics of object-oriented programming languages rely on pointers. We introduce a semantics for pointer structures. Pointers are seen as indexes and pointer fields are functions from these indexes to values. Using this semantics we turn all pointer operation...
متن کاملReasoning about Policies using Logic Programs
We use a simplified version of the Policy Description Language 3)2)£ introduced in (Lobo, Bhatia, & Naqvi 1999) to represent and reason about policies. In 3)2)£ a policy description is a collection of Event-ConditionAction-Rules that defines a mapping from event histories into action histories. In this paper we introduce the generation problem: finding an event history that generates a given ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Security
سال: 2018
ISSN: 1875-8924,0926-227X
DOI: 10.3233/jcs-17971